AtAPSK_NTD revised

نویسندگان

  • Geoffrey E. Ravilious
  • Corey S. Westfall
  • Joseph M. Jez
چکیده

Background: Adenosine 5'-phosphosulfate kinase (APSK) in plants contains a regulatory disulfide bond. Results: Analysis of oxidized APSK reveals altered nucleotide binding compared to the reduced enzyme. Conclusion: The N-terminal domain is responsible for redox-linked structural changes that regulate APSK activity. Significance: This work provides a molecular basis for understanding reciprocal regulation at a branchpoint in plant sulfur metabolism.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the revised edge-Szeged index of graphs

The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...

متن کامل

On the Representation of Bloom's Revised Taxonomy in Interchange Coursebooks

This study intends to evaluate Interchange series (2005), which are still fundamental coursebooks in the EFL curriculum settings, in terms of learning objectives in Bloom’s Revised Taxonomy (2001) to see which levels of Bloom's Revised Taxonomy were more emphasized in these coursebooks. For this purpose, the contents of Interchange textbooks were codified based on a coding scheme designed by th...

متن کامل

PI, Szeged and Revised Szeged Indices of IPR Fullerenes

In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.

متن کامل

A N‎ote on Revised Szeged ‎Index of ‎Graph ‎Operations

Let $G$ be a finite and simple graph with edge set $E(G)$‎. ‎The revised Szeged index is defined as‎ ‎$Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$‎ ‎where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and‎ ‎$n_{G}(e)$ is the number of‎ ‎equidistant vertices of $e$ in $G$‎. ‎In this paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013